Applying Evolution Strategies to a University Timetabling System

نویسندگان

  • Thomas B. George
  • ChanJin Chung
چکیده

Determining the best, or near best timetable of lecture/courses for a university department, which optimizes enrollment, is a challenging problem. Described herein is a platform developed to accept student-generated data of course preferences, the university department curriculum, and resource constraints. The platform then generates the best or near best feasible schedule using an Evolutionary Computation Algorithm combining crossover and mutation for a fixed population. In addition, the platform permits manipulation of the population size, the initial mutation rate, the rule for varying the mutation rate, and the crossover point the platform order to examine the impact of these parameters and to determine the best values for this class of timetable problem. While this is an ongoing project, included is a sample run on an artificial data sample which shows the efficiency of the algorithm.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

University Course Timetabling Using ACO: A Case Study on Laboratory Exercises

The ant colony optimisation metaheuristic has shown promise on simplified artificial instances of university course timetabling problems. However, limited work has been done applying it to practical timetabling problems. In this paper, we describe the application of the ant colony optimisation to a highly constrained real–world instance of the university course timetabling problem. We present t...

متن کامل

Using fuzzy c-means clustering algorithm for common lecturer timetabling among departments

University course timetabling problem is one of the hard problems and it must be done for each term frequently which is an exhausting and time consuming task. The main technique in the presented approach is focused on developing and making the process of timetabling common lecturers among different departments of a university scalable. The aim of this paper is to improve the satisfaction of com...

متن کامل

Generating Optimal Timetabling for Lecturers using Hybrid Fuzzy and Clustering Algorithms

UCTTP is a NP-hard problem, which must be performed for each semester frequently. The major technique in the presented approach would be analyzing data to resolve uncertainties of lecturers’ preferences and constraints within a department in order to obtain a ranking for each lecturer based on their requirements within a department where it is attempted to increase their satisfaction and develo...

متن کامل

Interactive Timetabling

Timetabling is a typical application of constraint programming whose task is to allocate activities to slots in available resources respecting various constraints like precedence and capacity. In this paper we present a basic concept, a constraint model, and a solution algorithm for interactive timetabling. Interactive timetabling combines automated timetabling (the computer allocates the activ...

متن کامل

Genetic Algorithms for University Course Timetabling Problems

The university course timetabling problem is a difficult optimisation problem due to its highly-constrained nature. Finding an optimal, or even a high quality, timetable is a challenging task, especially when resources (e.g., rooms and time slots) are limited. In the literature, many approaches have been studied to solve this problem. In this thesis, we investigate genetic algorithms to solve t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002